Optimizing Tensor Product Computations in Stochastic Automata Networks
نویسنده
چکیده
In this paper we consider some numerical issues in computing solutions to networks of stochastic automata (SAN). In particular our concern is with keeping the amount of computation per iteration to a minimum, since iterative methods appear to be the most eeective in determining numerical solutions. In a previous paper we presented complexity results concerning the vector-descriptor multiplication phase of the analysis. In this paper our concern is with optimizations related to the implementation of this algorithm. We also consider the possible beneets of grouping automata in a SAN with many small automata, to create an equivalent SAN having a smaller number of larger automata.
منابع مشابه
Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations
• The main idea is to obtain a generalized tensor description of the transition probability matrix or the transition rate matrix • N finite automata. One automaton is used to model one component. • The state space is included into the Cartesian product of the state space of the automata.
متن کاملMemory-Efficient Kronecker Algorithms with Applications to the Modelling of Parallel Systems
Parallel and distributed systems can be modelled as a set of interacting components. This has an impact on the mathematical structure of the model, namely it induces a product form represented by a tensor product. We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of...
متن کاملLow-Rank Tensor Methods for Communicating Markov Processes
Stochastic models that describe interacting processes, such as stochastic automata networks, feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this work, we discuss the approximation of solutions by matrix product states or, equivalently, by ...
متن کاملLow-rank tensor methods for communicating Markow processes
Stochastic models that describe interacting processes, such as stochastic automata networks, feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this work, we discuss the approximation of solutions by matrix product states or, equivalently, by ...
متن کاملThe Kronecker Product and Stochastic Automata Networks
This paper can be thought of as a companion paper to Van Loan’s The Ubiquitous Kronecker Product paper [23]. We collect and catalog the most useful properties of the Kronecker product and present them in one place. We prove several new properties that we discovered in our search for a Stochastic Automata Network preconditioner. We conclude by describing one application of the Kronecker product,...
متن کامل